- finite alphabet
- конечный алфавит
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
finite alphabet
Смотреть что такое "finite alphabet" в других словарях:
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Finite state transducer — A finite state transducer (FST) is a finite state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite state automaton (or finite state acceptor), which has a single tape. OverviewAn automaton can be… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Alphabet (computer science) — In computer science, an alphabet is a, usually finite, set of characters or digits. The most common alphabet is {0,1}, the binary alphabet. A finite string is a finite sequence of characters from an alphabet; for instance a binary string is a… … Wikipedia
Alphabet (disambiguation) — An alphabet is a complete standardized set of letters basic written symbols each of which roughly represents a phoneme of a spoken language, either as it exists now or as it may have been in the past. * Alphabets derived from the Latin ** Latin… … Wikipedia
alphabet — noun /ˈæl.fəˌbɛt/ a) The set of letters used when writing in a language. The Greek alphabet has only twenty four letters. b) A typically finite set of distinguishable symbols. In the first year of school, pupils are taught to recite the alphabet … Wiktionary
Quantum finite automata — In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be… … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Generalized nondeterministic finite state machine — In the theory of computation, a generalized nondeterministic finite state machine or generalized nondeterministic finite automaton (GNFA) is a NFA where each transition may be labeled with any regular expression. The GNFA reads blocks of symbols… … Wikipedia
